1746B - Rebellion - CodeForces Solution


binary search constructive algorithms greedy

Please click on ads to support us..

Python Code:

from sys import stdin
from collections import Counter

def readint():
    return int(stdin.readline())

def readarray(typ):
    return list(map(typ, stdin.readline().split()))

if __name__ == "__main__":
    t = readint()
    for _ in range(t):
        n = readint()
        A = readarray(int)
        c_whole = Counter(A)

        final_index = n - c_whole[1]

        c_partial = Counter(A[:final_index])

        print(c_partial[1])

C++ Code:

#include<bits/stdc++.h>
using namespace std;
int main(){
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        int arr[n];
        for(int i=0;i<n;i++){
            cin>>arr[i];
        }
        int i=0,j=n-1,ans=0;
        while(i<j){
            if(arr[i]==0){
                i++;
                continue;
            }
            if(arr[j]==1){
                j--;
                continue;
            }
            ans++;
            i++;
            j--;
        }
        cout<<ans<<"\n";
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

289B - Polo the Penguin and Matrix
1716A - 2-3 Moves
1670B - Dorms War
1716B - Permutation Chain
987A - Infinity Gauntlet
1676G - White-Black Balanced Subtrees
1716D - Chip Move
1352F - Binary String Reconstruction
1487B - Cat Cycle
1679C - Rooks Defenders
56A - Bar
1694B - Paranoid String
35A - Shell Game
1684A - Digit Minimization
43B - Letter
1017A - The Rank
1698B - Rising Sand
235A - LCM Challenge
1075B - Taxi drivers and Lyft
1562A - The Miracle and the Sleeper
1216A - Prefixes
1490C - Sum of Cubes
868A - Bark to Unlock
873B - Balanced Substring
1401D - Maximum Distributed Tree
1716C - Robot in a Hallway
1688B - Patchouli's Magical Talisman
99A - Help Far Away Kingdom
622B - The Time
1688C - Manipulating History